Witness (Delaunay) graphs

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Witness (Delaunay) graphs

Proximity graphs are used in several areas in which a neighborliness relationship for input data sets is a useful tool in their analysis, and have also received substantial attention from the graph drawing community, as they are a natural way of implicitly representing graphs. However, as a tool for graph representation, proximity graphs have some limitations that may be overcome with suitable ...

متن کامل

Witness Gabriel graphs

We consider a generalization of the Gabriel graph, the witness Gabriel graph. Given a set of vertices P and a set of witness points W in the plane, there is an edge ab between two points of P in the witness Gabriel graph GG−(P,W ) if and only if the closed disk with diameter ab does not contain any witness point (besides possibly a and/or b). We study several properties of the witness Gabriel g...

متن کامل

Witness Rectangle Graphs

In a witness rectangle graph (WRG) on vertex point set P with respect to witness point set W in the plane, two points x, y in P are adjacent whenever the open rectangle with x and y as opposite corners contains at least one witness point in W . WRGs are representative of a much larger family of witness proximity graphs introduced in two previous papers. We study graph-theoretic properties of WR...

متن کامل

Stable Delaunay Graphs

Let P be a set of n points in R2, and let DT(P) denote its Euclidean Delaunay triangulation. We introduce the notion of an edge of DT(P) being stable. Defined in terms of a parameter α > 0, a Delaunay edge pq is called α-stable, if the (equal) angles at which p and q see the corresponding Voronoi edge epq are at least α. A subgraph G of DT(P) is called (cα, α)-stable Delaunay graph (SDG in shor...

متن کامل

Outerplanar graphs and Delaunay triangulations

Over 20 years ago, Dillencourt [1] showed that all outerplanar graphs can be realized as Delaunay triangulations of points in convex position. His proof is elementary, constructive and leads to a simple algorithm for obtaining a concrete Delaunay realization. In this note, we provide two new, alternate, also quite elementary proofs.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Computational Geometry

سال: 2011

ISSN: 0925-7721

DOI: 10.1016/j.comgeo.2011.01.001